Iterative Mining for Rules with Constrained Antecedents
نویسندگان
چکیده
In this study we discuss the problem of mining association rules with constrained antecedents in a large database of sales transactions or clickstream records. For a user-defined set A of items, this problem asks for computing all association rules (satisfying suitable support and confidence thresholds) induced by A, where an association rule is said to be induced by A if its antecedent (i.e., LHS) is a subset of A while the consequent (i.e., RHS) contains no items in A. In particular, we are interested in a multi-step scenario where in each step A is incremented by one item and all association rules induced by the updated A are to be computed. We propose an efficient iterative algorithm that can exploit mining information gained in previous steps to efficiently answer subsequent queries.
منابع مشابه
Entropy Based Fuzzy Rule Weighting for Hierarchical Intrusion Detection
Predicting different behaviors in computer networks is the subject of many data mining researches. Providing a balanced Intrusion Detection System (IDS) that directly addresses the trade-off between the ability to detect new attack types and providing low false detection rate is a fundamental challenge. Many of the proposed methods perform well in one of the two aspects, and concentrate on a su...
متن کاملIdentifying and Evaluating Effective Factors in Green Supplier Selection using Association Rules Analysis
Nowadays companies measure suppliers on the basis of a variety of factors and criteria that affect the supplier's selection issue. This paper intended to identify the key effective criteria for selection of green suppliers through an efficient algorithm callediterative process mining or i-PM. Green data were collected first by reviewing the previous studies to identify various environmental cri...
متن کاملDeriving General Association Rules from XML Data
XML documents have become poplar because the semi-structure nature of XML allows a wide variety of data to be represented in XML. Association rule mining is an important problem in the data mining domain. Currently, the problem of association rule mining on XML data has not been well studied. Existing work only addresses the problem of mining specific association rules from XML data. Such techn...
متن کاملAn Algorithm of Constrained Spatial Association Rules Based on Binary
An algorithm of constrained association rules mining was presented in order to search for some items expected by people. Since some presented algorithms of association rules mining based on binary are complicated to generate frequent candidate itemsets, they may pay out heavy cost when these algorithms are used to extract constrained spatial association rules. And so this paper proposes an algo...
متن کاملA Nonnegatively Constrained Iterative Method with Statistically Based Stopping Rules for Ct, Pet, and Spect Imaging
In this paper, we extend a nonnegatively constrained iterative method and three stopping rules for its iterations to the medical imaging inverse problems of computed tomography (CT), positron emission tomography (PET), and single photon emission computed tomography (SPECT); the iterative method and stopping rules were introduced for use in astronomical imaging. The paper begins with a brief int...
متن کامل